منابع مشابه
Diagonal Matrix Reduction over Refinement Rings
Abstract: A ring R is called a refinement ring if the monoid of finitely generated projective R- modules is refinement. Let R be a commutative refinement ring and M, N, be two finitely generated projective R-nodules, then M~N if and only if Mm ~Nm for all maximal ideal m of R. A rectangular matrix A over R admits diagonal reduction if there exit invertible matrices p and Q such that PAQ is...
متن کاملReplacement, reduction and refinement.
In 1959, William Russell and Rex Burch published "The Principles of Humane Experimental Technique". They proposed that if animals were to be used in experiments, every effort should be made to Replace them with non-sentient alternatives, to Reduce to a minimum the number of animals used, and to Refine experiments which used animals so that they caused the minimum pain and distress. These guidin...
متن کاملBalancing reduction and refinement.
The classic Russell & Burch1 sequence of applying the Three Rs first examines how to replace the use of the animal, followed by how to reduce numbers through good experimental design. Then ways to minimise pain and distress (and improve animal welfare) through refinements are considered. If this sequence is followed slavishly, there is a risk that the drive to reduce animal numbers will oversha...
متن کاملBinding Refinement for Multiplexer Reduction
In behavioral synthesis for resource shared architecture, multiplexers are inserted between registers and functional units as a result of binding if necessary. Multiplexer optimization in binding is important for performance, area and power of a synthesized circuit. In this paper, we propose a binding algorithm to reduce total amount of multiplexer ports. Unlike most of the previous works in wh...
متن کاملDimension Reduction via Colour Refinement
Colour refinement is a basic algorithmic routine for graph isomorphism testing, appearing as a subroutine in almost all practical isomorphism solvers. It partitions the vertices of a graph into “colour classes” in such a way that all vertices in the same colour class have the same number of neighbours in every colour class. Tinhofer [27], Ramana, Scheinerman, and Ullman [23] and Godsil [12] est...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.02.014